Generalized permutation characters of solvable groups

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On solvable minimally transitive permutation groups

We investigate properties of finite transitive permutation groups (G, Ω) in which all proper subgroups of G act intransitively on Ω. In particular, we are interested in reduction theorems for minimally transitive representations of solvable groups.

متن کامل

Expanding Generator Sets for Solvable Permutation Groups

Let G = 〈S〉 be a solvable permutation group given as input by the generating set S. I.e. G is a solvable subgroup of the symmetric group Sn. We give a deterministic polynomial-time algorithm that computes an expanding generating set of size Õ(n2) for G. More precisely, given a λ < 1, we can compute a subset T ⊂ G of size Õ(n2) ( 1 λ )O(1) such that the undirected Cayley graph Cay(G,T ) is a λ-s...

متن کامل

Some connections between powers of conjugacy classes and degrees of irreducible characters in solvable groups

‎Let $G$ be a finite group‎. ‎We say that the derived covering number of $G$ is finite if and only if there exists a positive integer $n$ such that $C^n=G'$ for all non-central conjugacy classes $C$ of $G$‎. ‎In this paper we characterize solvable groups $G$ in which the derived covering number is finite‎.‎ 

متن کامل

The Minimal Base Size of Primitive Solvable Permutation Groups

A base of a permutation group G is a sequence B of points from the permutation domain such that only the identity of G fixes B pointwise. Answering a question of Pyber, we prove that all primitive solvable permutation groups have a base of size at most four.

متن کامل

Near-Optimal Expanding Generating Sets for Solvable Permutation Groups

Let G = 〈S〉 be a solvable permutation group of the symmetric group Sn given as input by the generating set S. We give a deterministic polynomial-time algorithm that computes an expanding generating set of size Õ(n) for G. More precisely, the algorithm computes a subset T ⊂ G of size Õ(n)(1/λ) such that the undirected Cayley graph Cay(G, T ) is a λ-spectral expander (the Õ notation suppresses lo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1985

ISSN: 0021-8693

DOI: 10.1016/0021-8693(85)90170-x